From Closure Games to Strong Kleene Truth
نویسنده
چکیده
In this paper, we study the method of closure games, a gametheoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3and 4-valued Strong Kleene fixed points in a novel and informative manner. Amongst others, we also present closure games which induce the minimal and maximal intrinsic fixed point of the Strong Kleene schema.
منابع مشابه
Infinitary Tableau for Semantic Truth
We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantini supervaluation. The value of these systems is that they provide an easy method of proving simple facts about semantic theories. Moreover we shall show that they also give us a simpler understanding of the computational complexity of these definitions and provi...
متن کاملOn Paraconsistent Weak Kleene Logic and Involutive Bisemilattices - Part I
In his Introduction to Metamathematics [13, § 64], S.C. Kleene distinguishes between a “strong sense” and a “weak sense” of propositional connectives when partially defined predicates are present. Each of these meanings is made explicit via certain 3-valued truth tables, which have become widely known as strong Kleene tables and weak Kleene tables, respectively. If the elements of the base set ...
متن کاملA Mechanization of Strong Kleene Logic for Partial Functions
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional log...
متن کاملAxiomatizing Kripke's Theory of Truth
We investigate axiomatizations of Kripke’s [18] theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman’s axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke’s semantics in the straightforward sense; only the sentences provably true in KF are valid in Kripke’s partial ...
متن کاملHintikka-Style Semantic Games for Fuzzy Logics
Various types of semantics games for deductive fuzzy logics, most prominently for Lukasiewicz logic, have been proposed in the literature. These games deviate from Hintikka’s original game for evaluating classical first-order formulas by either introducing an explicit reference to a truth value from the unit interval at each game state (as in [4]) or by generalizing to multisets of formulas to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 57 شماره
صفحات -
تاریخ انتشار 2016